#define DEBUG
#include <cstdio>
#include <cstring>
#define MAXLEN 100000
#define K 10000

using namespace std;

int max(int a, int b) {
  return a<b ? a : b;
}

class Bignum {
public:
  int a[MAXLEN+1];

  void init(char *s) {
    int len=strlen(s);
    a[0] = 1, a[1]=0;
    for (int i=len-1, p=1; i>=0; i--) {
      if (a[a[0]]+p*(s[i]-'0')>K) {
	a[++a[0]] = 0;
	p=1;
      }
      a[a[0]] += p*(s[i]-'0');
    }
  }

  static void add(const Bignum *a, int b, Bignum *c) {
    c->a[1] = b;
    for (int i=1; i<=a->a[0]; i++) {
      c->a[i] += a->a[i];
      c->a[i+1] = c->a[i]/K;
      c->a[i] = (c->a[i]%K+K)%K;
    }
    c->a[0] = c->a[a->a[0]+1] ? a->a[0]+1 : (a->a[a->a[0]] ? a->a[0] : a->a[0]-1);
  }

  static void dec(const Bignum *a, const Bignum *b, Bignum *c) {
    c->a[1] = 0;
    for (int i=1; i<=a->a[0]; i--) {
      if (i<=b->a[0]) {
	c->a[i] += a->a[i]-b->a[i];
      }
      c->a[i+1] = (c->a[i]/K);
      c->a[i] = (c->a[i]%K+K)%K;
    }
    c->a[0] = c->a[a->a[0]] ? a->a[0] : a->a[0]-1;
  }

  static void mul(const Bignum *a, const Bignum *b, Bignum *c) {
    static int book[MAXLEN+1], ver;
    ver++;
    for (int i=1; i<=a->a[0]; i++) {
      for (int j=1; j<=b->a[0]; j++) {
	if (book[i+j-1]!=ver) {
	  book[i+j-1] = ver;
	  c->a[i+j-1] = 0;
	}
	if (book[i+j]!=ver) {
	  book[i+j] = ver;
	  c->a[i+j] = 0;
	}
	c->a[i+j-1] += a->a[i]*b->a[j];
	c->a[i+j] += c->a[i+j-1]/K;
	c->a[i+j-1] %= K;
      }
    }
  }

  static int div(const Bignum *a, int b, Bignum *c) {
    int rest=0;
    for (int i=a->a[0]; i>0; i--) {
      c->a[i] = (rest*K+a->a[0])/b;
      rest = (rest*K+a->a[0])%b;
    }
    return rest;
  }
};

int main() {
#ifdef DEBUG
  freopen("4758.in", "r", stdin);
  freopen("4758.out", "w", stdout);
#endif

  static char s[MAXLEN+1];
  scanf("%s", s);
  static Bignum n, ans[3], temp[5];
  n.init(s);
  Bignum::div(&n, 2, &temp[4]);

  for (int i=1; i<=6; i++) {
    temp[i%2]
      }

  return 0;
}
